Non-approximability of weighted multiple sequence alignment for arbitrary metrics
نویسنده
چکیده
We prove that the multiple sequence alignment problem with weighted sum-of-pairs score is APX-hard for arbitrary metric scoring functions over the binary alphabet. This holds even when the weights are restricted to zero and one.
منابع مشابه
Non-approximability of Weighted Multiple Sequence Alignment
We consider a weighted generalization of multiple sequence alignment with sumof-pair score. Multiple sequence alignment without weights is known to be NPcomplete and can be approximated within a constant factor, but it is unknown whether it has a polynomial time approximation scheme. Weighted multiple sequence alignment can be approximated within a factor of O(log n) where n is the number of se...
متن کاملAn Application of the ABS LX Algorithm to Multiple Sequence Alignment
We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...
متن کاملComplete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables
Let be a sequence of arbitrary random variables with and , for every and be an array of real numbers. We will obtain two maximal inequalities for partial sums and weighted sums of random variables and also, we will prove complete convergence for weighted sums , under some conditions on and sequence .
متن کاملMinimizing the energy consumption and the total weighted tardiness for the flexible flowshop using NSGA-II and NRGA
This paper presents a bi-objective MIP model for the flexible flow shop scheduling problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...
متن کاملGoal Programming Optimization Model for Performance Management: A SCOR-Based Supply Chain Decision Alignment
This article develops an integrated model of transmitting strategies and operational activities to enhance the efficiency of supply chain management. As the second objective, this paper aims to improve supply chain performance management (SCPM) by employing proper decision-making approaches. The proposed model optimizes the performance indicator based on SCOR metrics. A process-based method is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 95 شماره
صفحات -
تاریخ انتشار 2005